A Vehicle Routing Problem With Option for Outsourcing and Time-Dependent Travel Time

This paper studies the time-dependent vehicle routing problem with private fleet and common carriers (TDVRPPC), which provides an option to outsource customer requests considers real-world travel times. The is commonly seen in transportation logistics industries as it impact of changing traffic conditions on times, maximum working hour regulations well capacity constraints. time modeled a piecewise linear function, based mixed integer programming model proposed for TDVRPPC. To solve this NP-hard problem, we customize hybrid algorithm harness adaptive large neighborhood search exploration tabu exploitation search. Through constraint relaxation, dynamic coordinated adjustment diversification intensification strengths hybridized procedures, effective segment-based evaluation method, performs newly generated test instances TDVRPPC benchmark simplified (VRPPC).